Spin Wave Based Approximate Computing

Imprecise Minority-Based Full Adder for ‎Approximate Computing Using CNFETs

   Nowadays, the portable multimedia electronic devices, which employ signal-processing modules, require power aware structures more than ever. For the applications associating with human senses, approximate arithmetic circuits can be considered to improve performance and power efficiency. On the other hand, scaling has led to some limitations in performance of nanoscale circuits. According...

Spin-Based Quantum Dot Quantum Computing

Computing Approximate Diagnoses By Using Approximate Entailment

The most widely accepted models of diagnostic reasoning are all phrased in terms of the logical consequence relations. In work in recent years, Schaerf and Cadoli have proposed e cient approximations of the classical consequence relation. The central idea of this paper is to parameterise the notion of diagnosis over di erent approximations of the consequence relation. This yields a number of di...

Modeling Approximate Computing Techniques

The efficiency–accuracy trade-off of approximate computing spans a diverse array of techniques at both the hardware and software levels. While this diversity is key to the success of approximation research, it also entails considerable complexity in developing and validating new approximation techniques. Researchers must relate their ideas to a vast body of work on approximate computing and inv...

Computing Approximate PSD Factorizations

We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron. This strictly...